Generating self-complementary uniform hypergraphs
نویسنده
چکیده
منابع مشابه
Self-Complementary Hypergraphs
In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement. This yields a test to determine whether a finite p...
متن کاملVertex-transitive self-complementary uniform hypergraphs
In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniform hypergraph of order n, where k = 2 or k = 2 + 1 and n ≡ 1 (mod 2), then the highest power of any prime dividing n must be congruent to 1 modulo 2. We show that this necessary condition is also sufficient in ...
متن کاملA note on k-uniform self-complementary hypergraphs of given order
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if ( n k ) is even.
متن کاملA note on 2-subset-regular self-complementary 3-uniform hypergraphs
We show that a 2-subset-regular self-complementary 3-uniform hypergraph with n vertices exists if and only if n ≥ 6 and n is congruent to 2 modulo 4.
متن کاملVertex-Transitive q-Complementary Uniform Hypergraphs
For a positive integer q, a k-uniform hypergraph X = (V,E) is q-complementary if there exists a permutation θ on V such that the sets E,E, E 2 , . . . , E q−1 partition the set of k-subsets of V . The permutation θ is called a q-antimorphism of X. The well studied self-complementary uniform hypergraphs are 2-complementary. For an integer n and a prime p, let n(p) = max{i : p i divides n}. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010